Euclidean Skeletons Using Closest Points
نویسندگان
چکیده
In this paper, we present an efficient algorithm for computing the Euclidean skeleton of an object directly from a point cloud representation on an underlying grid. The key point of this algorithm is to identify those grid points that are (approximately) on the skeleton using the closest point information of a grid point and its neighbors. The three main ingredients of the algorithm are: (1) computing closest point information efficiently on a grid, (2) identifying possible skeletal points based on the number of closest points of a grid point and its neighbors with smaller distances, (3) applying a distance ordered homotopic thinning process to remove the non-skeletal points while preserving the end points or the edge points of the skeleton. Computational examples in 2D and 3D are presented.
منابع مشابه
A Simple Analysis of Rabin ’ s Algorithm for Finding Closest Pairs ∗
The closest-pair problem is one of the most basic topics in computational geometry: given a set P ⊂ R of n points in the plane, find two distinct points p, q ∈ P that minimize the Euclidean distance d(p, q), among all pairs of points in P . In the algebraic decision tree model, this problem can be solved optimally in Θ(n log n) time. However, already in 1976, Rabin observed in a seminal work th...
متن کامل2D Closest Pair Problem: A Closer Look
A closer look is taken at the well-known divide-andconquer algorithm for finding the closest pair of a set of points in the plane under the Euclidean distance. An argument is made that it is sufficient, and sometimes necessary, to check only the next three points following the current point associated with the y-sorted array in the combine phase of the algorithm.
متن کاملBranch Voxels and Junctions in 3D Skeletons
Branch indices of points on curves (introduced by Urysohn and Menger) are of basic importance in the mathematical theory of curves, defined in Euclidean space. This paper applies the concept of branch points in the 3D orthogonal grid, motivated by the need to analyze curve-like structures in digital images. These curve-like structures have been derived as 3D skeletons (by means of thinning). Th...
متن کاملA Linear Time Euclidean Spanner on Imprecise Points
An s-spanner on a set S of n points in R is a graph on S where for every two points p, q ∈ S, there exists a path between them in G whose length is less than or equal to s · |pq| where |pq| is the Euclidean distance between p and q. In this paper, we consider the construction of a Euclidean spanner for imprecise points where we take advantage of prior, inexact knowledge of our input. In particu...
متن کاملEfficient Euclidean distance transform algorithm of binary images in arbitrary dimensions
In this paper, we propose an efficient algorithm, i.e., PBEDT, for short, to compute the exact Euclidean distance transform (EDT) of a binary image in arbitrary dimensions. The PBEDT is based on independent scan and implemented in a recursive way, i.e., the EDT of a d-dimensional image is able to be computed from the EDTs of its ðd 1Þ-dimensional sub-images. In each recursion, all of the rows i...
متن کامل